On the Zeros of Polynomials with Littlewood-type Coefficient Constraints

نویسندگان

  • Tamás Erdélyi
  • TAMÁS ERDÉLYI
چکیده

For z0 ∈ C and r > 0, let D(z0, r) := {z ∈ C : |z − z0| < r} . In this paper we show that a polynomial p of the form

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polynomials with Littlewood-Type Coefficient Constraints

This survey paper focuses on my contributions to the area of polynomials with Littlewood-type coefficient constraints. It summarizes the main results from many of my recent papers some of which are joint with Peter Borwein. §

متن کامل

Markov-bernstein Type Inequalities under Littlewood-type Coefficient Constraints

Let Fn denote the set of polynomials of degree at most n with coefficients from {−1, 0, 1}. Let Gn be the collection of polynomials p of the form

متن کامل

Trigonometric Polynomials with Many Real Zeros and a Littlewood-type Problem

We examine the size of a real trigonometric polynomial of degree at most n having at least k zeros in K := R (mod 2π) (counting multiplicities). This result is then used to give a new proof of a theorem of Littlewood concerning flatness of unimodular trigonometric polynomials. Our proof is shorter and simpler than Littlewood’s. Moreover our constant is explicit in contrast to Littlewood’s appro...

متن کامل

Some compact generalization of inequalities for polynomials with prescribed zeros

‎Let $p(z)=z^s h(z)$ where $h(z)$ is a polynomial‎ ‎of degree at most $n-s$ having all its zeros in $|z|geq k$ or in $|z|leq k$‎. ‎In this paper we obtain some new results about the dependence of $|p(Rz)|$ on $|p(rz)| $ for $r^2leq rRleq k^2$‎, ‎$k^2 leq rRleq R^2$ and for $Rleq r leq k$‎. ‎Our results refine and generalize certain well-known polynomial inequalities‎.

متن کامل

Expected Number of Real Zeros for Random Linear Combinations of Orthogonal Polynomials

We study the expected number of real zeros for random linear combinations of orthogonal polynomials. It is well known that Kac polynomials, spanned by monomials with i.i.d. Gaussian coefficients, have only (2/π + o(1)) logn expected real zeros in terms of the degree n. On the other hand, if the basis is given by Legendre (or more generally by Jacobi) polynomials, then random linear combinations...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013